منابع مشابه
Strongly Stable Networks ∗ by
We analyze the formation of networks among individuals. In particular, we examine the existence of networks that are stable against changes in links by any coalition of individuals. We show that to investigate the existence of such strongly stable networks one can restrict focus on a component-wise egalitarian allocation of value. We show that when such strongly stable networks exist they coinc...
متن کاملStrongly stable networks
We analyze the formation of networks among individuals. In particular, we examine the existence of networks that are stable against changes in links by any coalition of individuals. We show that to investigate the existence of such strongly stable networks one can restrict focus on a component-wise egalitarian allocation of value. We show that when such strongly stable networks exist they coinc...
متن کاملStrongly stable gyroscopic systems
Here, gyroscopic systems are time-invariant systems for which motions can be characterized by properties of a matrix pencil L(λ) = λ2I + λG − C, where GT = −G and C > 0. A strong stability condition is known which depends only on |G| (= (GT G)1/2 ≥ 0) and C. If a system with coefficients G0 and C satisfies this condition then all systems with the same C and with a G satisfying |G| ≥ |G0| are al...
متن کاملStrongly Stable Assignment
An instance of the stable assignment problem consists of a bipartite graph with arbitrary node and edge capacities, and arbitrary preference lists (allowing both ties and incomplete lists) over the set of neighbors. An assignment is strongly stable if there is no blocking pair where one member of the pair strictly prefers the other member to some partner in the current assignment, and the other...
متن کاملCharacterisation of Strongly Stable Matchings
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph G = (A ∪ B,E), with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given vertex. Ties are disjoint and may contain one vertex. A matching M is a set of vertex-disjoint edges. An edge (x, y) ∈ E \M is a blocking edge for M if x is eit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2005
ISSN: 0899-8256
DOI: 10.1016/j.geb.2004.08.004